On computing the syndrome polynomial in Reed-Solomon decoder

نویسندگان

  • Elena Costa
  • Sergei V. Fedorenko
  • Peter Trifonov
چکیده

Application of the cyclotomic Fast Fourier Transform algorithm to the syndrome evaluation problem in classical Reed-Solomon decoders is described. A number of complexity reduction tricks is suggested. Application of the algorithm leads to significant reductions in the complexity of syndrome evaluation. Moreover, automatic generation of the program code implementing the described algorithm is possible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient algorithm for computing syndrome polynomial in Reed- Solomon decoder

Application of the cyclotomic Fast Fourier Transform algorithm to the syndrome evaluation problem in classical Reed-Solomon decoders is described. A number of complexity reduction tricks is suggested. Application of the algorithm leads to significant reductions in the complexity of syndrome evaluation. Moreover, automatic generation of the program code implementing the described algorithm is po...

متن کامل

A (204,188) Reed-Solomon Decoder using Decomposed Euclidean Algorithm

The DVB Project, which is used for broadcasting all kinds of data has very successfully developed a considerable list of specifications for Digital Video Broadcasting. In order to mitigate the errors, a (204,188) Reed-Solomon Decoder is used in DVB for error correction. A ( N , K ) RS code contains K message symbols and N K parity checking symbols, and is capable of correcting up to t = lv J sy...

متن کامل

Iterative Multivariate Interpolation for Low Complexity Reed - Solomon Codes

The algebraic soft-decoding (ASD) of Reed– Solomon (RS) codes provides significant coding gain over hard-decision decoding with polynomial complexity. In order to reduce the complexity in this paper, high-throughput interpolator architecture for soft-decision decoding of Reed– Solomon (RS) codes based on low-complexity chase (LCC) decoding is presented. An efficiency is low, in terms of areadel...

متن کامل

Reed Solomon Encoder/Decoder on the StarCore SC140/SC1400 Cores, With Extended Examples

1 Basics of Forward Error Correction (FEC) .............2 2 Theory ..................................................................... 3 2.1 Galois Fields ........................................................... 3 2.2 Reed-Solomon Codes ..............................................6 2.3 Error-Correcting Performance of Reed-Solomon Codes ..............................................9 3 SC...

متن کامل

A (31,15) Reed-Solomon code for large memory systems

This paper describes the encoding and the decoding of a (31,15) Reed-Solomon Code for multiple-burst error correction for large memory systems. The decoding procedure consists of four steps-(1) syndrome calculation, (2) errorlocation polynomial calculation, (3) error-location numbers calculation and (4) error values calculation. The principal features of the design are the use of a hardware shi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • European Transactions on Telecommunications

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2004